package com.example.bootdemo.tree1;



public class BinaryTreeDemo1 {
    public static void main(String[] args) {
        //先需要创建一颗二叉树
        BinaryTree1 binaryTree = new BinaryTree1();
        //创建需要的结点
        HeroNode1 root = new HeroNode1(1, "宋江");
        HeroNode1 node2 = new HeroNode1(2, "吴用");
        HeroNode1 node3 = new HeroNode1(3, "卢俊义");
        HeroNode1 node4 = new HeroNode1(4, "林冲");
        HeroNode1 node5 = new HeroNode1(5, "关胜");

        //说明，我们先手动创建该二叉树，后面我们学习递归的方式创建二叉树

        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        node3.setLeft(node5);
        binaryTree.setRoot(root);



        //测试
	/*	System.out.println("前序遍历"); // 1,2,3,5,4
		binaryTree.preOrder();*/

        //测试
// 		System.out.println("中序遍历");
// 	binaryTree.infixOrder(); // 2,1,5,3,4
////
//		System.out.println("后序遍历");
//		binaryTree.postOrder(); // 2,5,4,3,1

        //前序遍历
        //前序遍历的次数 ：4
//		System.out.println("前序遍历方式~~~");
//		HeroNode1 resNode = binaryTree.preOrderSearch(5);
//		if (resNode != null) {
//			System.out.printf("找到了，信息为 no=%d name=%s", resNode.getNo(), resNode.getName());
//		} else {
//			System.out.printf("没有找到 no = %d 的英雄", 5);
//		}

        //中序遍历查找
        //中序遍历3次
		System.out.println("中序遍历方式~~~");
		HeroNode1 resNode = binaryTree.infixOrderSearch(5);
		if (resNode != null) {
			System.out.printf("找到了，信息为 no=%d name=%s", resNode.getNo(), resNode.getName());
		} else {
			System.out.printf("没有找到 no = %d 的英雄", 5);
		}

        //后序遍历查找
        //后序遍历查找的次数  2次
//		System.out.println("后序遍历方式~~~");
//		HeroNode1 resNode = binaryTree.postOrderSearch(5);
//		if (resNode != null) {
//			System.out.printf("找到了，信息为 no=%d name=%s", resNode.getNo(), resNode.getName());
//		} else {
//			System.out.printf("没有找到 no = %d 的英雄", 5);
//		}

        //测试一把删除结点

///*        System.out.println("删除前,前序遍历");
//        binaryTree.preOrder(); //  1,2,3,5,4
//        binaryTree.delNode(5);
//        //binaryTree.delNode(3);
//        System.out.println("删除后，前序遍历");
//        binaryTree.preOrder(); // 1,2,3,4*/
    }
}

class BinaryTree1 {
    private HeroNode1 root;

    public void setRoot(HeroNode1 root) {
        this.root = root;
    }

    //前序遍历
    public void preOrder() {
        if (root != null) {
            this.root.preOrder();
        } else {
            System.out.println("序列为空");
        }
    }

    //中序遍历
    public void infixOrder() {
        if (root != null) {
            this.root.infixOrder();
        } else {
            System.out.println("序列为空");
        }
    }

    public void postOrder() {
        if (root != null) {
            this.root.postOrder();
        } else {
            System.out.println("序列为空");
        }
    }

    public HeroNode1 preOrderSearch(int no) {
        if (root != null) {
            return this.root.preOrderSearch(no);
        } else {
            System.out.println("序列为空");
            return null;
        }
    }

    public HeroNode1 infixOrderSearch(int i) {
        if (root != null) {
            return root.infixOrderSearch(i);
        } else {
            System.out.println("序列为空");
            return null;
        }
    }
}
class HeroNode1{
    private int no;
    private String name;
    private HeroNode1 left; //默认null
    private HeroNode1 right; //默认null

    public HeroNode1(int no, String name) {
        this.no = no;
        this.name = name;
    }

    public int getNo() {
        return no;
    }
    public void setNo(int no) {
        this.no = no;
    }
    public String getName() {
        return name;
    }
    public void setName(String name) {
        this.name = name;
    }
    public HeroNode1 getLeft() {
        return left;
    }
    public void setLeft(HeroNode1 left) {
        this.left = left;
    }
    public HeroNode1 getRight() {
        return right;
    }
    public void setRight(HeroNode1 right) {
        this.right = right;
    }

    @Override
    public String toString() {
        return "HeroNode{" +               "no=" + no +                ", name='" + name + '\'' +                        '}';
    }

    //编写前序遍历的方法
    public void preOrder() {
     //   System.out.println("this");
        System.out.println(this);
        //递归向左子树前序遍历
        if (this.left!=null){
            this.left.preOrder();
        }
        //递归向右子树前序遍历
        if (this.right!=null){
            this.right.preOrder();
        }

    }

    public void infixOrder() {
        if (this.left!=null){
        this.left.infixOrder();
        }
        System.out.println(this);
        if (this.right!=null){
            this.right.infixOrder();
        }
    }

    public void postOrder() {
        if (this.left!=null){
            this.left.infixOrder();
        }
        if (this.right!=null){
            this.right.infixOrder();
        }

        System.out.println(this);
    }
    //前序遍历查找
    /**
     *
     * @param no 查找no
     * @return 如果找到就返回该Node ,如果没有找到返回 null
     */
    public HeroNode1 preOrderSearch(int no) {
        if (this.no==no){
            return this;
        }

        HeroNode1 resNode = null;
        if (this.left!=null){
            resNode= this.left.preOrderSearch(no);
        }
        if (resNode!=null){
           return resNode;
        }
        if (this.right!=null){
            resNode= this.right.preOrderSearch(no);
        }
        return resNode;
    }


    public HeroNode1 infixOrderSearch(int no) {
        //判断当前结点的左子节点是否为空，如果不为空，则递归后序查找
        HeroNode1 resNode = null;
        if (this.left!=null){
            resNode= this.left.infixOrderSearch(no);
        }
        if (resNode!=null){
            return resNode;
        }
        System.out.println("进入中序查找");
        if (this.no==no){
            return this;
        }
        if (this.right!=null){
            resNode=  this.right.infixOrderSearch(no);
        }
        return resNode;

    }
    public HeroNode1 postOrderSearch(int no) {
        //判断当前结点的左子节点是否为空，如果不为空，则递归后序查找
        HeroNode1 resNode = null;
        if (this.left!=null){
            resNode= this.left.postOrderSearch(no);
        }
        if (resNode!=null){
            return resNode;
        }

        if (this.right!=null){
            resNode=  this.right.postOrderSearch(no);
        }
        System.out.println("进入后序查找");
        if (resNode!=null){
            return resNode;
        }
        if (this.no==no){
            return this;
        }
        return resNode;

    }
    }
